Traceability in graphs with forbidden triples of subgraphs
نویسندگان
چکیده
If 9 is a collection of connected graphs, and if a graph G does not contain any member of 9 as an induced subgraph, then G is said to be F-free. The members of f in this situation are called forbidden subgraphs. In a previous paper (Gould and Harris, 1995) the authors demonstrated two families of triples of subgraphs which imply traceability when forbidden. In this paper the authors identify two additional families that enjoy this same property. @ 1998 Elsevier Science B.V. All rights reserved
منابع مشابه
Potential forbidden triples implying hamiltonicity: for sufficiently large graphs
In [2], Brousek characterizes all triples of connected graphs, G1, G2, G3, with Gi = K1,3 for some i = 1, 2, or 3, such that all G1G2G3free graphs contain a hamiltonian cycle. In [8], Faudree, Gould, Jacobson and Lesniak consider the problem of finding triples of graphs G1, G2, G3, none of which is a K1,s, s ≥ 3 such that G1G2G3-free graphs of sufficiently large order contain a hamiltonian cycl...
متن کاملForbidden subgraphs and the existence of a 2-factor
For a connected graph H, a graph G is said to be H-free if G does not contain an induced subgraph which is isomorphic to H, and for a set of connected graphs H, G is said to be H-free if G is H-free for every H ∈ H. The set H is called a forbidden subgraph. In particular, if |H| = 2 (resp. |H| = 3), we often call H a forbidden pair (resp. forbidden triple). In 1991, Bedrossian proved that there...
متن کاملCharacterizing forbidden pairs for hamiltonian properties 1
In this paper we characterize those pairs of forbidden subgraphs sufficient to imply various hamiltonian type properties in graphs. In particular, we find all forbidden pairs sufficient, along with a minor connectivity condition, to imply a graph is traceable, hamiltonian, pancyclic, panconnected or cycle extendable. We also consider the case of hamiltonian-connected graphs and present a result...
متن کاملForbidden Subgraphs for Planar Blict and Blitact Graphs
Many graphs which are encountered in the study of graph theory are characterized by a type of configuration or subgraphs they possess. However, there are occasions when such graphs are more easily defined or described by the kind of subgraphs they are not permitted to contain. Such subgraphs are called forbidden subgraphs. In this paper, we present characterizations of graphs whose blict and bl...
متن کاملForbidden triples and traceability: a characterization
Given a connected graph G, a family F of connected graphs is called a forbidden family if no induced subgraph of G is isomorphic to any graph in F. If this is the case, G is said to be F-free. In earlier papers the authors identi ed four distinct families of triples of subgraphs that imply traceability when they are forbidden in su ciently large graphs. In this paper the authors introduce a fth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 189 شماره
صفحات -
تاریخ انتشار 1998